Fuzzy C-Means Algorithm Based on Standard Mahalanobis Distances
نویسندگان
چکیده
Some of the well-known fuzzy clustering algorithms are based on Euclidean distance function, which can only be used to detect spherical structural clusters. Gustafson-Kessel clustering algorithm and Gath-Geva clustering algorithm were developed to detect non-spherical structural clusters. However, the former needs added constraint of fuzzy covariance matrix, the later can only be used for the data with multivariate Gaussian distribution. Two improved Fuzzy C-Means algorithm based on different Mahalanobis distance, called FCM-M and FCM-CM were proposed by our previous works, In this paper, A improved Fuzzy C-Means algorithm based on a standard Mahalanobis distance (FCM-SM) is proposed The experimental results of three real data sets show that our proposed new algorithm has the better performance.
منابع مشابه
Unsupervised Clustering Algorithm Based on Normalized Mahalanobis Distances
Some of the well-known fuzzy clustering algorithms are based on Euclidean distance function, which can only be used to detect spherical structural clusters. Gustafson-Kessel clustering algorithm and Gath-Geva clustering algorithm were developed to detect non-spherical structural clusters. However, the former needs added constraint of fuzzy covariance matrix, the later can only be used for the d...
متن کاملNormalized Clustering Algorithm Based on Mahalanobis Distance
FCM (fuzzy c-means algorithm) based on Euclidean distance function converges to a local minimum of the objective function, which can only be used to detect spherical structural clusters. The added fuzzy covariance matrices in their distance measure were not directly derived from the objective function. In this paper, an improved Normalized Clustering Algorithm Based on Mahalanobis distance by t...
متن کاملValues for the Fuzzy -means Classifier in Change Detection for Remote Sensing
We discuss an approach to change detection in digital remotely sensed imagery that relies on the Fuzzy Post Classification Comparison technique. We use the fuzzy -means classifier together with the Mahalanobis distance as the basis for a metric of class membership for a individual pixel. We note that the value of the fuzzy exponent in a fuzzy classifier is based on the ratios of the reciprocals...
متن کاملA New Fuzzy Noise-Rejection Data Partitioning Algorithm with Revised Mahalanobis Distance
Fuzzy C-Means (FCM) and hard clustering are the most common tools for data partitioning. However, the presence of noisy observations in the data may cause generation of completely unreliable partitions from these clustering algorithms. Also, application of the Euclidean distance in FCM only produces spherical clusters. In this paper, a new noise-rejection clustering algorithm based on Mahalanob...
متن کاملK-means Cluster Analysis and Mahalanobis Metrics: a Problematic Match or an Overlooked Opportunity?
In this paper we consider the performance of the widely adopted K-means clustering algorithm when the classification variables are correlated. We measure performance in terms of recovery of the true data structure. As expected, performance worsens considerably if the groups have elliptical instead of spherical shape. We suggest some modifications to the standard K-means algorithm which consider...
متن کامل